MINIMIZING THE DIAMETER IN TREE NETWORKS UNDER EDGE REDUCTIONS
نویسندگان
چکیده
منابع مشابه
Minimizing the Diameter in Tree Networks Under Edge Reductions
Edge reductions model the ability of speeding up communication between processors in a network. In this paper we consider performing edge reductions in a tree network so that the diameter of the tree is minimized. The diameter is directly related to the time needed to broadcast a message. In particular, fOr non-blocking message communication ignoring start-up costs, the diameter corresponds to ...
متن کاملMinimizing Broadcast Costs under Edge Reductions in Tree Networks
We study the broadcasting of messages in tree networks under edge reductions. When an edge is reduced, its cost becomes zero. Edge reductions model the decrease or elimination of broadcasting costs between adjacent nodes in the network. Let T be an n-vertex tree and B be a target broadcast cost. We present an O(n) time algorithm for determining the minimum number of edges of T to reduce so that...
متن کاملFinding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize the maximum delay in delivering a message. When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of a new spanning tree. Such an optimal replacement is called a best swap. As a natural exten...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملFinding Low Diameter Low Edge Cost Networks
This paper describes a simulated annealing algorithm to compute k connected graphs that minimize a linear combination of graph edge cost and diameter Repli cas of Internet information services can use graphs with these properties to propagate updates among themselves We report the algorithm s performance on and connected node graphs where edge cost and diame ter correspond to physical distance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 1999
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626499000335